All-integer column generation for set partitioning: Basic principles and extensions
نویسندگان
چکیده
Column generation, combined with an appropriate integer programming technique, has shown to be a powerful tool for solving huge integer programs arising in various applications. In these column generation approaches, the master problem is often of a set partitioning type. The set partitioning polytope has the quasi-integrality property, which enables the use of simplex pivots for finding improved integer solutions, each of which is associated with a linear programming basis. By combining such pivots with column generation, one obtains a method where each found solution to a restricted master problem is feasible, integer, and associated with a dual solution that can be used in a column generation step. This paper presents a framework for such an all-integer column generation approach to set partitioning problems. We give the basic principles of all-integer pivots and all-integer column generation. We also state optimality conditions and introduce means for preserving a basis in the event that a heuristic is applied to the master problem. These extensions introduce flexibility in the design of a specific solution scheme of this kind, and with proper settings optimal or approximate solutions can be sought for.
منابع مشابه
Column generation in the integral simplex method
The integral simplex method for set partitioning problems allows only pivots-on-one to be made, which results in a primal all-integer method. In this technical note we outline how to tailor the column generation principle to this method. Because of the restriction to pivots-onone, only local optimality can be guaranteed, and to ensure global optimality we consider the use of implicit enumeratio...
متن کاملSolving Parallel Machine Scheduling Problems by Column Generation
We consider a class of problems of scheduling n jobs on m identical, uniform, or unrelated parallel machines with an objective of minimizing an additive criterion. We propose a decomposition approach for solving these problems exactly. The decomposition approach rst formulates these problems as an integer program, and then reformulates the integer program, using Dantzig-Wolfe decomposition, as ...
متن کاملManuskripte Aus Den Instituten Ff Ur Betriebswirtschaftslehre Der Universit at Kiel Audit{staa Scheduling by Column Generation
When scheduling its audit{sta , the management of an auditing rm encompasses a number of decisions. These may be grouped into several categories which di er markedly in terms of organizational echelon involved, length of the planning horizon and the planning periods, degree of aggregation of the audit tasks, degree of detail of the required information, and decision objective. In this paper we ...
متن کاملCockpit Crew Pairing Problem in Airline Scheduling: Shortest Path with Resources Constraints Approach
Increasing competition in the air transport market has intensified active airlines’ efforts to keep their market share by attaching due importance to cost management aimed at reduced final prices. Crew costs are second only to fuel costs on the cost list of airline companies. So, this paper attempts to investigate the cockpit crew pairing problem. The set partitioning problem has been used for ...
متن کاملA column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
We propose a column generation based exact decomposition algorithm for the problem of scheduling n jobs with an unrestrictively large common due date on m identical parallel machines to minimize total weighted earliness and tardiness. We rst formulate the problem as an integer program, then reformulate it, using Dantzig-Wolfe decomposition, as a set partitioning problem with side constraints. B...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 233 شماره
صفحات -
تاریخ انتشار 2014